#include "heapList.h"
#include "logger.h"

void _deleteTree(Tree T)
{
    if (!T)
        return;
    _deleteTree(T->Left);
    _deleteTree(T->Right);
    free(T);
}

int IsFull(PriorityQueue H)
{
    if (H)
        return 1;
    return 0;
}
PriorityQueue Initialize()
{
    PriorityQueue H = NULL;
    H = malloc(sizeof(*H));
    if (!H)
        FatalError("Out of space");
    H->Size = 0;
    H->Tree = NULL;
    return H;
}

void MakeEmpty(PriorityQueue H)
{
    H->Size = 0;
    _deleteTree(H->Tree);
    return;
}

void Destory(PriorityQueue H)
{
    MakeEmpty(H);
    free(H);
    return;
}

void Insert(ElementType X, PriorityQueue H)
{
}

ElementType DeleteMin(PriorityQueue H)
{
}